polynomial complexity
英 [ˌpɒli'nəʊmiəl kəmˈpleksəti]
美 [ˌpɑli'noʊmiəl kəmˈpleksəti]
网络 多项式复杂度; 多项式复杂性
双语例句
- In this paper, based on a simplified Bayesian network classification model, we apply its structure learning algorithm, with polynomial time complexity, to the classification of database information, and get a compromise between the learning efficiency and classification precision.
本研究在一种简化的贝叶斯网络分类模型的基础上，利用其多项式时间复杂度的结构学习算法，将其应用于数据库信息分类，实现了学习效率和分类精度的一种折衷。 - We consider the Agent Coalition Formation Problem with logical dependency and transfer cost. And, we propose an algorithm with polynomial time complexity on the basis of Dynamic Planning, to solve this problem.
在考虑子任务间逻辑依赖关系和转移成本的情况下，探讨了针对这类复杂任务结构的服务Agent联盟形成问题，并且提出了一种基于动态规划的多项式时间算法。 - Authors produce an algorithm for seeking the maximum Capacity Paths from the specified node to all other nodes in the transportation network, which has polynomial complexity O ( n 2). The correctness of the algorithm is verified in detail.
给出了一个求运输网络从固定顶点到所有其他顶点的多项式算法x1，证明了该算法的正确性，分析了它的复杂性为O（n2）。 - This approach, taking the conventional detector output as the initial solution, uses the tabu search ( TS) algorithm directly to solve the nonlinear optimization problem of the optimum multiuser detection, it is conceptually simply and has polynomial computational complexity.
该方法利用传统检测方法的输出作为初始解，直接应用禁忌搜索算法来解决最佳多用户检测的非线性优化组合问题。 - Under certain condition the algorithm is complete and has polynomial complexity.
这种算法在一定的假设条件下，是完备的且仅具有多项式的计算复杂性。 - Finally, the problem of quadratic programming with integer constraints is solved by utilizing ε-approximation with polynomial approximate complexity.
采用具有多项式近似复杂度的ε近似算法解决带整数约束的二次规划问题。 - An Algorithm with Polynomial Time Complexity for Verifying Secrecy Properties of Cryptographic Protocols
一种多项式时间复杂度的密码协议秘密性验证方法 - The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。 - An approximation algorithm for the total tardiness problem is presented in this paper, which possesses the following properties: polynomial complexity, a local solution with respect to backward shift neighbourhood and finite performance ratio.
对于一台机器的总延误问题，本文提出了一个近似算法，它具有以下性质：多项式复杂度，给出局部解（相应于后移邻域），有界的性能比。 - An algorithm is presented for seeking the critical paths in the overall planning graph, which has polynomial complexity O ( n 3). The theory, which the algorithm depends on, is verified in detail.
给出了1个求统筹图中关键路线的多项式算法，证明了该算法的理论依据，分析了它的复杂性为O（n3）。